Satisfiability modulo theories - PDFSEARCH.IO - Document Search Engine

Satisfiability modulo theories
Results: 199

#	Item
161	metaSMT: Focus On Your Application Not On Solver Integration Finn Haedicke Stefan Frehse Add to Reading List Source URL: www.informatik.uni-bremen.de Language: English - Date: 2011-09-06 04:07:56 Constraint programming Electronic design automation Formal methods Logic in computer science NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Solver Constraint satisfaction problem Theoretical computer science Applied mathematics Mathematics
162	metaSMT: A Unified Interface to SMT-LIB2 Heinz Riener1 Mathias Soeken1,2 Clemens Werther1 Add to Reading List Source URL: www.informatik.uni-bremen.de Language: English - Date: 2014-07-29 13:06:58 Electronic design automation Formal methods Logic in computer science Constraint programming Satisfiability Modulo Theories Solver Boolean satisfiability problem Timeout Transmission Control Protocol Theoretical computer science Applied mathematics NP-complete problems
163	metaSMT: Focus On Your Application Not On Solver Integration Finn Haedicke, Stefan Frehse, Görschwin Fey, Daniel Große, Rolf Drechsler Group of Computer Architecture, University of Bremen, Germany Add to Reading List Source URL: www.informatik.uni-bremen.de Language: English - Date: 2014-02-05 05:31:31 Logic in computer science Electronic design automation NP-complete problems Constraint programming Satisfiability Modulo Theories Valuation Integer factorization Theoretical computer science Applied mathematics Formal methods
164	Conflict-Guided Simplification for SAT Michael L. Case1,2 , Sanjit A. Seshia1 , Alan Mishchenko1 , and Robert K. Brayton1 1 2 Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2008-01-31 13:42:07 Logic in computer science NP-complete problems Automated theorem proving Constraint programming Electronic design automation Boolean satisfiability problem Resolution Conjunctive normal form Satisfiability Modulo Theories Theoretical computer science Mathematics Applied mathematics
165	Partial Replay of Long-Running Applications Alvin Cheung, Armando Solar-Lezama, and Samuel Madden MIT CSAIL {akcheung, asolar, madden}@csail.mit.edu Add to Reading List Source URL: db.csail.mit.edu Language: English - Date: 2011-08-15 13:47:43 Constraint programming Software bugs Formal methods Logic in computer science Memory management Concolic testing Symbolic execution Debugger Satisfiability Modulo Theories Software engineering Theoretical computer science Computing
166	Synthesizing Safe Bit-Precise Invariants? Arie Gurfinkel, Anton Belov and Joao Marques-Silva Abstract. Bit-precise software verification is an important and difficult problem. While there has been an amazing progress in Add to Reading List Source URL: anton.belov-mcdowell.com Language: English - Date: 2014-01-27 10:25:19 Propositional calculus Boolean algebra Electronic design automation Logic in computer science NP-complete problems Boolean satisfiability problem Satisfiability Modulo Theories Well-formed formula Unsatisfiable core Logic Theoretical computer science Mathematical logic
167	BARF: A multiplatform open source Binary Analysis and Reverse engineering Framework Christian Heitman and Iv´an Arce Fundaci´ on Sadosky, {cnheitman,iarce}@fundacionsadosky.org.ar Add to Reading List Source URL: www.fundacionsadosky.org.ar Language: English - Date: 2014-10-23 11:23:52 Assembly languages Constraint programming Electronic design automation Satisfiability Modulo Theories X86 MOV High Level Assembly X86 assembly language Computer architecture Theoretical computer science Computing
168	FrankenBit: Bit-Precise Verification with Many Bits (Competition Contribution)? Arie Gurfinkel1 and Anton Belov2 1 Carnegie Mellon Software Engineering Institute Add to Reading List Source URL: anton.belov-mcdowell.com Language: English - Date: 2014-01-27 10:25:19 Constraint programming Electronic design automation Logic in computer science Satisfiability Modulo Theories LLVM Z3 Invariant Model checking Theoretical computer science Computing Software engineering
169	Growing Solver-Aided Languages with ROSETTE Emina Torlak Rastislav Bodik U.C. Berkeley Add to Reading List Source URL: homes.cs.washington.edu Language: English - Date: 2014-08-13 19:26:58 Numerical software Functions and mappings Boolean algebra Algebraic logic Parity Satisfiability Modulo Theories Tcl Symbolic execution FO Mathematics Theoretical computer science Physics